The condition for the applicability of the Viterbi algorithm with implications for fading channel MLSD
نویسنده
چکیده
The general condition for the optimality of the Viterbi algorithm (VA) as a method for implementing maximumlikelihood sequence detection (MLSD) is described. It is shown that this folding condition is not met for the fading linear Gaussian channel. This clarifies previously published results and allows approaches for approximate MLSD to be viewed as an attempt to force the VA as a suboptimal solution.
منابع مشابه
Dual Switched Predictive DIR MLSD Receiver for Dynamic Channels
A linear prefilter can be used to reduce the required complexity of a maximum likelihood sequence detector Viterbi algorithm (MLSD-VA) by shortening the overall channel and prefilter impulse response in dynamic communication systems. The combination of channel and prefilter should have the effect of producing a desired impulse response (DIR) at the detector. Falconer and Magee (1973) showed tha...
متن کاملJoint Closed-Loop Power Control and Base Station Assignment for DS-CDMA Receiver in Multipath Fading Channel with Adaptive Beamforming Method
In this paper, we propose smart step closed-loop power control (SSPC) algorithm and base station assignment based on minimizing the transmitter power (BSAMTP) technique in a direct sequence-code division multiple access (DS-CDMA) receiver in the presence of frequency-selective Rayleigh fading. This receiver consists of three stages. In the first stage, with conjugate gradient (CG) adaptive ...
متن کاملMLSE receiver using the particle filtering over a multipath fading channel
Instead of reduced-state decision-feedback sequence estimation (DFSE) equalization which is the state-of-the-art solution for the complexity reduction of the full-state Viterbi decoder over a fading multipath channel, we propose a new reducedcomplexity maximum likelihood sequence detector (MLSD) based on the particle filtering technique. The computational complexity of this new detector is adap...
متن کاملThe Viterbi algorithm and Markov noise memory
This work designs sequence detectors for channels with intersymbol interference (ISI) and correlated (and/or signal-dependent) noise. We describe three major contributions. i) First, by modeling the noise as a finite-order Markov process, we derive the optimal maximum-likelihood sequence detector (MLSD) and the optimal maximum a posteriori (MAP) sequence detector, extending to the correlated no...
متن کاملTracking performance of incremental LMS algorithm over adaptive distributed sensor networks
in this paper we focus on the tracking performance of incremental adaptive LMS algorithm in an adaptive network. For this reason we consider the unknown weight vector to be a time varying sequence. First we analyze the performance of network in tracking a time varying weight vector and then we explain the estimation of Rayleigh fading channel through a random walk model. Closed form relations a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Communications
دوره 46 شماره
صفحات -
تاریخ انتشار 1998